We present sem_ind, a recommendation tool for proof by induction in Isabelle/HOL. Given an inductive problem, sem_ind produces candidate arguments for proof by induction, and selects promising ones using heuristics. Our evaluation based on 1,095 inductive problems from 22 source files shows that sem_indimproves the accuracy of recommendation from 20.1% to 38.2% for the most promising candidates within 5.0 seconds of timeout compared to its predecessor while decreasing the median value of execution time from 2.79 seconds to 1.06 seconds.This technical appendix provides details of the evaluation results, which are omitted from our paper accepted to IJCAI2021
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Sledgehammer integrates external automatic theorem provers (ATPs) in the Isabelle/HOL proof assistan...
Sledgehammer for Isabelle/HOL integrates automatic theorem provers to discharge interactive proof ob...
Proof assistants offer tactics to facilitate inductive proofs; however, deciding what arguments to p...
Recently, a growing number of researchers have applied machine learning to assist users of interacti...
Recently, a growing number of researchers have applied machine learning to assist users of interacti...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
Proof assistants offer tactics to apply proof by induction, but these tactics rely on inputs given b...
Introduction The Isabelle/HOL environment [8] combines the power of au-tomated reasoning with higher...
We significantly improve the performance of the E automated theorem prover on the Isabelle Sledgeham...
Isabelle/Isar is a generic framework for human-readable formal proof documents, based on higher-orde...
Abstract. Proof assistants in the LCF tradition, such as Coq, Isabelle, and the HOL family, are noto...
This paper describes how we have added an efficient function for computation to the kernel of the Ca...
Proofs by induction are central to many computer science areas such as data structures, theory of co...
In this project we investigate the potential of an automated system for inductive proofs within the ...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Sledgehammer integrates external automatic theorem provers (ATPs) in the Isabelle/HOL proof assistan...
Sledgehammer for Isabelle/HOL integrates automatic theorem provers to discharge interactive proof ob...
Proof assistants offer tactics to facilitate inductive proofs; however, deciding what arguments to p...
Recently, a growing number of researchers have applied machine learning to assist users of interacti...
Recently, a growing number of researchers have applied machine learning to assist users of interacti...
Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to gu...
Proof assistants offer tactics to apply proof by induction, but these tactics rely on inputs given b...
Introduction The Isabelle/HOL environment [8] combines the power of au-tomated reasoning with higher...
We significantly improve the performance of the E automated theorem prover on the Isabelle Sledgeham...
Isabelle/Isar is a generic framework for human-readable formal proof documents, based on higher-orde...
Abstract. Proof assistants in the LCF tradition, such as Coq, Isabelle, and the HOL family, are noto...
This paper describes how we have added an efficient function for computation to the kernel of the Ca...
Proofs by induction are central to many computer science areas such as data structures, theory of co...
In this project we investigate the potential of an automated system for inductive proofs within the ...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Sledgehammer integrates external automatic theorem provers (ATPs) in the Isabelle/HOL proof assistan...
Sledgehammer for Isabelle/HOL integrates automatic theorem provers to discharge interactive proof ob...